A Hybrid Algorithm for Strip Packing Problem with Rotation Constraint
نویسندگان
چکیده
منابع مشابه
A Harmonic Algorithm for the 3D Strip Packing Problem
In the three dimensional strip packing problem, we are given a set of three dimensional rectangular items and a three dimensional box B. The goal is to pack all the items in B such that the height of the packing is minimized. We consider the most basic version of the problem, where the items must be packed with their edges parallel to the edges of B and cannot be rotated. Building upon Caprara’...
متن کاملA genetic algorithm for the two-dimensional strip-packing problem
The paper presents a genetic algorithm (GA) for the two-dimensional strip-packing problem (SPP) with rectangular shaped pieces. Both the non-guillotinable SPP and the guillotinable SPP can be tackled. The genetic algorithm has been derived from a GA that was proposed earlier for solving the container-loading problem (CLP) with a single container to be loaded. The characteristic features of the ...
متن کاملA Meta-heuristic Algorithm for the Strip Rectangular Packing Problem
A new meta-heuristic algorithm to find the minimum height for twodimensional strip rectangular packing problem is presented. This algorithm is mainly based on the heuristic recursive strategy and simulated annealing algorithm. The computational results on a class of benchmark problems have shown that this algorithm not only finds shorter height than known meta-heuristic but also runs in shorter...
متن کاملGRASP-VNS hybrid for the Strip Packing Problem
In this work we consider an hybrid metaheuristic approach to solve the Strip Packing Problem. In the hybrid algorithm, we use an Variable Neighbourhood Search (VNS) to improve the quality of part of the solution obtained with a Greedy Randomized Adaptive Search Procedure (GRASP). Then, the results achieved with the hybrid method are compared with those existing in the literature. From these res...
متن کاملA Tunned-parameter Hybrid Algorithm for Dynamic Facility Layout Problem with Budget Constraint using GA and SAA
A facility layout problem is concerned with determining the best position of departments, cells, or machines on the plant. An efficient layout contributes to the overall efficiency of operations. It’s been proved that, when system characteristics change, it can cause a significant increase in material handling cost. Consequently, the efficiency of the current layout decreases or is lost and it ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: MATEC Web of Conferences
سال: 2016
ISSN: 2261-236X
DOI: 10.1051/matecconf/20166806001